Net processes correspond to derivation processes in graph grammars

Concatenable Graph Processes: Relating Processes and Derivation Traces

Several formal concurrent semantics have been proposed for graph rewriting, a powerful formalism for the specification of concurrent and distributed systems which generalizes P/T Petri nets. In this paper we relate two such semantics recently proposed for the algebraic doublepushout approach to graph rewriting, namely the derivation trace and the graph process semantics. The notion of concatena...

Derivation Languages of Graph Grammars

We investigate sequential derivation languages associated with graph grammars, as a loose generalisation of free-labeled Petri nets and Szilard languages. The grammars are used to output strings of rule labels, and the applicability of a special rule determines the acceptance of a preceding derivation. Due to the great power of such grammars, this family of languages is quite large and endowed ...

Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO

The formal model of recursive communicating processes (RCPS) is important in practice but does not allows to derive decidability results for model checking questions easily. We focus a partial order representation of RCPS’s execution by graphs—so called run graphs, and suggest an under-approximative verification approach based on a bounded-treewidth requirement. This allows to directly derive p...

Grammars as Processes

In 1999 I met Grzegorz Rozenberg in Amsterdam, while I was attending the ETAPS conference and he was taking part in a meeting. The next day I was giving a talk with the title “Grammars as Processes”, and Grzegorz, who had seen it announced in the program, asked me about it. We had little time, and so I could barely sketch the contents. I think Grzegorz would have liked the talk, because it poin...

Adaptive Derivation Processes